Computational Semantics with Functional Programming

نویسندگان

  • Jan van Eijck
  • Christina Unger
چکیده

ing from the domain of discourse, we can say that determiner interpretations (henceforth simply called determiners) pick out binary relations on sets of individuals, on arbitrary domains of discourse E. The notation is DEAB. We call A the restriction of the quantifier and B its body. If DEAB is the translation of a simple sentence consisting of a quantified noun phrase with an intransitive verb phrase, then the noun denotation is the restriction and the verb phrase denotation the body. So in the example All dwarfs work, the NP all dwarfs is the restriction of the determiner all, and the VP work is the body. See Figure 7.2 for a general graphical representation. Fig. 7.2. Interpretation of DEAB as a relation between sets A and B E

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming

In our previous work Go&al 91] we used a restricted kind of applicative rewriting systems as computational model for higher-order (HO) lazy functional programming, and we proved soundness and completeness of innnite rewriting w.r.t. a declarative semantics, in the spirit of logic programming. The aim of this paper is to present similar results for functional logic programming. We model HO funct...

متن کامل

Adequacy for Algebraic Effects

Moggi proposed a monadic account of computational effects. He also presented the computational λ-calculus, λc, a core call-by-value functional programming language for effects; the effects are obtained by adding appropriate operations. The question arises as to whether one can give a corresponding treatment of operational semantics. We do this in the case of algebraic effects where the operatio...

متن کامل

Computational Adequacy via `Mixed' Inductive De nitions

For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance, proofs of correspondence between operational and denotational semantics (or between two diierent denotational semantics) often depend upon the existence of relations speciied as the xed point of non-monotonic operators. This paper describes a new approach to constructing such relatio...

متن کامل

Logical Foundations for Multi-agent Systems

9 Computational Linguistics Implementing Natural Language Semantics with Functional Programming http://research.nii.ac.jp/~kanazawa/Courses/2011/Seminar/i ndex.html Makoto Kanazawa Associate Professor Master's or Ph.D. students 2 3–6 months This internship involves implementing in a functional programming language semantic rules for some fragments of English (and possibly other languages) that ...

متن کامل

Computing Science Group FULL ABSTRACTION FOR NOMINAL EXCEPTIONS AND GENERAL REFERENCES

Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names and nominal general references. Here we make a step further by developing a fully abstract semantics for a language with nominal...

متن کامل

Denotational Versus Declarative Semantics for Functional Programming

Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010